منابع مشابه
Controllable-Choice Message Sequence Graphs
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restricted class of MSG, so called controllable-choice MSG, and show that all its models are realizable...
متن کاملMorphing Planar Graphs Drawings Efficiently
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved tha...
متن کاملOn the construction of Q-controllable graphs
A connected graph is called Q-controllable if its signless Laplacian eigenvalues are mutually distinct and main. Two graphs G and H are said to be Q-cospectral if they share the same signless Laplacian spectrum. In this paper, infinite families of Q-controllable graphs are constructed, by using the operator of rooted product introduced by Godsil and McKay. In the process, infinitely many non-is...
متن کاملAn Efficiently Learnable Constructive Method for Graphs
Graph data structures allow us to model complex entities in a natural and expressive way. In the literature, several types of discriminative systems that can deal with graphs in input are known (e.g. recursive neural networks, graph kernels, etc), however, there are few generative or constructive approaches that can output graphs belonging with high probability to a desired distribution or clas...
متن کاملSolving Matching Problems Efficiently in Bipartite Graphs
We investigate the problem maxDMM of computing a largest set of pairwise disjoint maximum matchings in undirected graphs as introduced by P. J. Slater in the case of trees. In this paper, n, m denote, respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an O(n 1.5 m/ log n + mn log n)-time algorithm. We design better algorithms for com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2017
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.118.260501